Adaptive Tensor Rank Approximation for Multi-View Subspace Clustering
نویسندگان
چکیده
Multi-view subspace clustering under a tensor framework remains challenging problem, which can be potentially applied to image classification, impainting, denoising, etc. There are some existing tensor-based multi-view models mainly making use of the consistency in different views through nuclear norm (TNN). The diversity means intrinsic difference individual view is always ignored. In this paper, new tensorial model proposed, jointly exploits both and each view. representation decomposed into view-consistent part (low-rank part) view-specific (diverse part). A adaptive log-determinant regularization (TALR) imposed on low-rank better relax multi-rank, sparsity diverse ensure connectedness property. Although TALR minimization not convex, it has closed-form analytical solution its convergency validated mathematically. Extensive evaluations six widely used datasets executed our demonstrated have superior performance.
منابع مشابه
Multi-view low-rank sparse subspace clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...
متن کاملMulti-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank
In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...
متن کاملLow-rank Multi-view Clustering in Third-Order Tensor Space
The plenty information from multiple views data as well as the complementary information among different views are usually beneficial to various tasks, e.g., clustering, classification, de-noising. Multi-view subspace clustering is based on the fact that the multi-view data are generated from a latent subspace. To recover the underlying subspace structure, the success of the sparse and/or low-r...
متن کاملRobust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization
Most recently, tensor-SVD is implemented on multi-view self-representation clustering and has achieved the promising results in many real-world applications such as face clustering, scene clustering and generic object clustering. However, tensor-SVD based multi-view self-representation clustering is proposed originally to solve the clustering problem in the multiple linear subspaces, leading to...
متن کاملRobust Localized Multi-view Subspace Clustering
In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of realworld applications, the confidence levels of samples in the same viewmay also vary. Thus considering a unified weight for a view may lead to suboptim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Electronics
سال: 2023
ISSN: ['1022-4653', '2075-5597']
DOI: https://doi.org/10.23919/cje.2022.00.180